Pii: S0168-9274(99)00108-7
نویسندگان
چکیده
We present a new third-order essentially non-oscillatory central scheme for approximating solutions of twodimensional hyperbolic conservation laws. Our scheme is based on a two-dimensional extension of the centered weighted essentially non-oscillatory (CWENO) reconstruction we presented in Levy et al. [3]. This is a “true” 2D method; it is not based on a direction-by-direction approach. Our method is formalized in terms of a black box which needs as an input only the specific flux. The numerical results we present support our expectations for a robust and high-resolution method. 2000 IMACS. Published by Elsevier Science B.V. All rights reserved.
منابع مشابه
Pii: S0168-9274(98)00108-1
A new family of iterative block methods, the family of block EN-like methods, is introduced. Efficient versions are presented and computational complexity, memory requirements and convergence properties are investigated. Finally, leading evidence of the potential of the new family is demonstrated via a comparison of numerical results and performance to other block methods. 1999 Elsevier Scien...
متن کاملPii: S0168-9274(99)00020-3
We compare several methods for sensitivity analysis of differential–algebraic equations (DAEs). Computational complexity, efficiency and numerical conditioning issues are discussed. Numerical results for a chemical kinetics problem arising in model reduction are presented. 2000 IMACS. Published by Elsevier Science B.V. All rights reserved.
متن کاملPii: S0168-9274(99)00131-2
We study numerical integrators that contract phase space volume even when the ODE does so at an arbitrarily small rate. This is done by a splitting into two-dimensional contractive systems. We prove a sufficient condition for Runge–Kutta methods to have the appropriate contraction property for these two-dimensional systems; the midpoint rule is an example. 2000 IMACS. Published by Elsevier Sc...
متن کاملPii: S0168-9274(99)00082-3
A fast Chebyshev–Fourier algorithm for Poisson-type equations in polar geometries is presented in this paper. The new algorithm improves upon the algorithm of Jie Shen (1997), by taking advantage of the odd–even parity of the Fourier expansion in the azimuthal direction, and it is shown to be more efficient in terms of CPU and memory. 2000 IMACS. Published by Elsevier Science B.V. All rights ...
متن کاملPii: S0168-9274(99)00114-2
This paper concerns the iterative solution of the linear system arising from the Chebyshev–collocation approximation of second-order elliptic equations and presents an optimal multigrid preconditioner based on alternating line Gauss–Seidel smoothers for the corresponding stiffness matrix of bilinear finite elements on the Chebyshev–Gauss–Lobatto grid. 2000 IMACS. Published by Elsevier Science...
متن کامل